#include <stdio.h>
#include <stdlib.h>

// #include "wdsort.h"
#include "sort.hpp"

void helper(ElemType a[], int n);

int main(int argc, char const *argv[])
{
    int a[] = {0, 9, 43, 52, 26, 34, 73, 31, 65};
    int b[] = {0, 34, 19, 53, 15, 47, 16, 98, 14, 93, 94, 57, 30, 24, 52, 86, 45, 56, 23, 66, 35};
    // InsertSort(a, 9);
    // InsertSort(b, 21);

    BinaryInsertSort(a, 9);
    BinaryInsertSort(b, 21);
    helper(a, 9);
    helper(b, 21);
    return 0;
}

void helper(ElemType a[], int n)
{
    for (int i = 0; i < n; i++)
    {
        printf("%d, ", a[i]);
    }
    printf("\n");
}